Normal form algorithms for extended context-free grammars
نویسندگان
چکیده
منابع مشابه
Normal form algorithms for extended context-free grammars
We investigate the complexity of a variety of normal-form transformations for extended context-free grammars, where by extended we mean that the set of right-hand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of context-free objects just as Grail does for re...
متن کاملExtended Context-Free Grammars and Normal Form Algorithms
We investigate the complexity of a variety of normal-form transformations for extended context-free grammars, where by extended we mean that the set of right-hand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of context-free objects just as Grail does for re...
متن کاملMarciani Normal Form of context-free grammars
In this paper, we prove the semidecidability of the problem of saying whether or not a context-free grammar generates a regular language. We introduce the notion of contextfree grammar in Marciani Normal Form. We prove that a context-free grammar in Marciani Normal Form always generates a regular language. CCS Concepts •Theory of computation → Grammars and contextfree languages;
متن کاملThe Parsing of Extended Context-free Grammars
Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to be any nite language. We develop a novel approach to top-down predictive parser construction for extended context-free grammars that is based on rewriting of partial syntax trees. This work is motivated by our development of...
متن کاملNormal forms for linear displacement context-free grammars
In this paper we prove several results on normal forms for linear displacement context-free grammars. The results themselves are rather simple and use well-known techniques, but they are extensively used in more complex constructions. Therefore this article mostly serves educational and referential purposes. 1 Displacement context-free grammars Displacement context-free grammars (DCFGs) are a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00294-2